Efficient task replication for fast response times in parallel computation
نویسندگان
چکیده
منابع مشابه
Parallel computation framework for optimizing trailer routes in bulk transportation
We consider a rich tanker trailer routing problem with stochastic transit times for chemicals and liquid bulk orders. A typical route of the tanker trailer comprises of sourcing a cleaned and prepped trailer from a pre-wash location, pickup and delivery of chemical orders, cleaning the tanker trailer at a post-wash location after order delivery and prepping for the next order. Unlike traditiona...
متن کاملComputation-Efficient Parallel Prefix
We are interested in solving the prefix problem of n inputs using p < n processors on completely connected distributed-memory multicomputers (CCDMMs). This paper improves a previous work in three respects. First, the communication time of the previous algorithm is reduced significantly. Second, we show that p(p + 1)/2 < n is required for the new algorithm and the original one to be applicable. ...
متن کاملFast Parallel Computation of Redundancy
For redundant manipulators, the inverse kinematics equations are typically solved by taking the pseudoinverse of the Jacobian, or by adding enough constraints to algebraically remove the redundancy. Many popular measures of redundancy also depend on computing the algebraic rank or determinant of the Jacobian. We present fast, parallelizable algorithms to dynamically update all the pseudo-invers...
متن کاملFast Parallel File Replication In Data Grid
Parallel file replication where a large file needs to be simultaneously replicated to multiple sites is an integral part of dataintensive grid environment. Current data transport mechanisms such as GridFTP is mainly created for point-to-point file transfer and not for parallel point-to-multipoint transfer (required in replication). This paper presents a tool that creates multiple distribution t...
متن کاملEfficient, Massively Parallel Eigenvalue Computation
In numerical simulations of disordered electronic systems, one of the most common approaches is to diagonalize random Hamiltonian matrices and to study the eigenvalues and eigenfunctions of a single electron in the presence of a random potential. In this paper, we describe an effort to implement a matrix diagonalization routine for real symmetric dense matrices on massively parallel SIMD comput...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMETRICS Performance Evaluation Review
سال: 2014
ISSN: 0163-5999
DOI: 10.1145/2637364.2592042